Methods and systems for monitoring network routing

ABSTRACT

The disclosed methods and systems include collecting routing data from a plurality of network routers, and correlating the routing data across routers and across time to obtain network data. The network data can be streamed to a user in real-time and the user can interactively query the data. In one embodiment, interactive routing analyses, drill-down, and forensics can be performed using a repository of Border Gateway Protocol (BGP) update traffic. Alarms can be set to detect selected routing problems. In setting the alarms, the message data for each router can be processed in timestamp order. Current message data from each router can be compared with previous message data to determine a condition status. An alarm can be provided when the condition status meets a temporal correlation criterion and/or a spatial correlation criterion.

RELATED APPLICATIONS

This application claims priority to, and incorporates by reference, theentire disclosure of U.S. Provisional Patent Application No. 60/455,722,filed on Mar. 18, 2003.

BACKGROUND

(1) Field

The disclosed methods and systems relate to monitoring network routing,and more particularly to monitoring, collecting, analyzing andpresenting to users network data from a plurality of network routers.

(2) Description of Relevant Art

Though transparent to most users, the global routing infrastructure, ascharacterized by the Internet and World Wide Web (WWW) is not a fullyautomated system. It can depend on the constant efforts of large numbersof network operators and engineers around the world. Accidentalmisconfigurations and failures can and do happen regularly, anddeliberate infrastructure attacks are an ever-present danger. ExternalBorder Gateway Protocol (BGP) routing problems endanger seamlessoperation of extranets, virtual private networks (VPNs), portals,logistics chains, network-delivered services and other distributed ITsystems. Typically, existing network monitoring solutions can be limitedto monitoring an organization's internal routers. Such monitoring doesnot afford an opportunity to observe dynamic changes of the routes thatother nodes on the network take to access the organization's routers.

BGP routing is a critical part of the global communicationsinfrastructure. Because BGP provides the mechanics for globalredistribution of routing information, failures in BGP due tomisconfigurations, hardware problems, router software bugs, and networkattacks can have serious and costly impacts on any networked enterprise.In general, the global Internet can be composed of Autonomous Systems(ASes) glued together using BGP. The ASes can include independentlyadministered IP networks, ranging in size from global enterprises withthousands of big routers to tiny operations with a single PC router.There is no global coordination of BGP routes. Instead, BGP routerschoose and re-announce routes according to the local administrativepolicy applied to routing messages it receives from its neighbors. Thepolicy coordination is generally limited to neighboring ASes, and thusBGP routes are constructed piecewise, from AS to AS. Well-managed ASescoordinate their policies, while other ASes can become a source ofproblems that can spread worldwide.

The design of BGP (version 4) is based on the Internet environment ofthe early 1990's. In June 1994, there were about 400 active ASes, andabout 20,000 prefixes in a full table, the prefixes identifyinggroupings of nodes on the network. The largest AS had some 30 neighbors,and a Network Access Point (NAP) router might receive about a gigabyteof BGP messages per month. By contrast, in December 2002 there were over17,000 active ASes, about 120,000 prefixes in a full table, and an AScould have over 3,000 neighbors. While vendors have improved routerspeeds and the quality of BGP implementations in response to the largeincrease in routing traffic, there have not been corresponding stridesin building tools for addressing or managing routing complexity. Today,BGP message streams exchanged by border routers are bursty andvoluminous, and can exceed several gigabytes per day in a single routerin an Internet exchange, and routing patterns are constantly changing.BGP routing problems having global impacts on Internet traffic havebecome commonplace.

Such problems can have myriad root causes, including routermisconfigurations, link layer failures, software bugs, and collateraldamage from high-speed scanning and DoS attacks. BGP instabilityroutinely translates into degraded quality of service, and can result incomplete loss of connectivity. BGP route changes can propagaterelatively slowly on the network, with convergence times ranging fromtens of seconds to several minutes. Such route changes can createtransient unreachabilities and packet drops, which can affect largenumbers of traffic flows on today's high speed networks. Amisconfiguration or an attack can last many hours before it ismitigated. Routing problems can have significant economic consequences.Correctness and stability of BGP operation can be vital for the seamlessoperation of extranets, virtual private networks (VPNs), portals,supplier-provider logistics chains, network-delivered services and othermission-critical IT systems. Though often touted as overcoming routingproblems, virtual networks can be as vulnerable to BGP routing failuresas other connections traversing multiple ASes beyond theiradministrative reach.

A BGP failure to route enterprise traffic to strategically importantnetworks can be particularly frustrating if the root cause lies in aremote AS. The requirements of global communications thus imply a needfor monitoring the health of global routing for rapid problemmitigation. However, a lack of proper tools can limit existing networkmonitoring systems to the scope of a single AS. Basic Simple NetworkManagement Protocol (SNMP) based systems for monitoring of networkdevices and aggregate traffic are routinely deployed in networkedorganizations. They can provide important information about the flow oftraffic within a monitored AS, but generally cannot provide informationabout traffic that has left the AS. In fact, traffic to externaladdresses on the average traverses three to four ASes before it reachesits destination. A global BGP monitoring system that can quickly alertan organization to routing problems affecting the organization'straffic, regardless of where the problem originates in the Internet, canbe an important component of a comprehensive network management,security or surveillance system.

However, typical existing network monitoring solutions can be limited toan organization's own routers. Such solutions do not resolve problemsthat originate beyond the network's administrative boundary, especiallyif a problem originates further beyond the next-hop peer and/or providernetworks. Essentially, a single router, and even a single AS, can besaid to have a myopic view of the Internet—it can see the routesradiating from itself to networks in other ASes, but is blind to otherroutes traversing the Internet. However, correlating behavior based onthe unseen routes can help to localize BGP problems.

Generating real time BGP routing alarms and resolving their root causescan require multi-router, multi-AS monitoring. Periodic analysis ofrouting tables can be insufficient in that such periodic analysis onlyoffers snapshots frozen in time, missing the dynamics of the routingchanges propagating through the network. Current practices of BGPmonitoring, troubleshooting and security evaluation can typically bebased on a combination of SNMP based monitoring of one's own routers,various means for processing Internet Protocol (IP) BGP output,examination of routes in remote looking glass routers, and seekingcollaborative help from various operator's groups, such as the NorthAmerican Network Operators' Group (NANOG), and other, similar mailinglists. Such approaches can be slow and labor intensive, and requirehighly skilled professionals.

SUMMARY

The disclosed methods and systems include network monitoring servicesthat can monitor evolving routes to networks in real time as seen frommultiple vantage points in the network. Interactive routing analyses,drill-down and forensics can be performed using an extensive repositoryof Border Gateway Protocol update traffic. The routing message data canbe collected from a large number of routers on the network, andcorrelated across multiple routers and across time. Additionally, thedata in the repository can correlate with routing registry data and/orDomain Name Service (DNS) data. In one embodiment, the data can bestreamed to a user in real time (e.g., in XML or another format) andadditionally and/or optionally, the user can interactively query thedata. Alarms can be set to detect selected routing problems. In settingthe alarms, the message data for routers can be processed in timestamporder. Current message data from routers can be compared with previousmessage data to determine a condition status. An alarm can be fired whenthe condition status meets temporal correlation criteria and/or spatialcorrelation criteria.

As used herein, the “firing” of an alarm, and other derivatives of theword “fire” in relation to an alarm, can be understood to be thesetting, establishing, maintaining and/or providing of an alarm, whichcan be an audio, visual, and/or other indicator. Further, although thedisclosed methods and systems refer to “firing” an alarm when acondition or other criteria “exceeds a threshold,” it can be understoodthat such expression includes and thus also refers to a comparison ofone value (e.g., data) to another value (e.g., alarm threshold), andbased on the comparison, setting/firing an alarm, and/or notsetting/firing an alarm. As provided herein, to “stand down” an alarmcan be understood to unset, clear, not provide, not maintain, and/orotherwise eliminate an alarm that was previously provided, set,maintained, and/or established.

In one embodiment, the disclosed methods and systems include a computerprogram tangibly stored on a computer-readable medium and operable tocause a computer to enable monitoring network traffic, and can includeinstructions to collect routing message data from a plurality of routerson the network, correlate the routing message data across multiplerouters and across time to obtain correlated data, and analyze thecorrelated data to obtain routing patterns. The routing message data canbe Border Gateway Protocol message data. Collecting data can includecollecting structural information regarding the network, includingrouting registry data and Domain Name Service data. The structuralinformation can be correlated with the routing message data. The routingpatterns can be streamed in real-time over the network. Collecting thedata can include establishing sessions between collector routers andremote peer routers located in geographically diverse locations.

The computer program can include instructions to provide an alarm(s)(e.g., routing alarms) based on the routing patterns. To provide routingalarms, the computer program can include instructions to process themessage data for network prefixes in timestamp order, compare currentmessage data for prefixes with previous message data for the prefix todetermine a condition status for alarm conditions of the prefix, andfire the routing alarm for the prefix when the condition status meets atemporal correlation criteria and/or a spatial correlation criteria.Graphical representations of the fired routing alarms can be presentedto a user.

The computer program can determine that the condition status meets thetemporal correlation criteria when the condition status indicates atleast one of the alarm conditions is high for a predetermined timeduration, and that the condition status meets the spatial correlationcriteria when the condition status for a predetermined number ofprefixes indicate a same alarm condition is high. The computer programcan further determine that the condition status meets the spatialcorrelation criteria when the condition status for a predeterminednumber of prefixes having a specified geographical distribution indicatea same alarm condition is high.

The instructions to provide the routing alarms can further includeinstructions to assign a value to the routing alarms, apply a processingscheme to the values (e.g., to decrease the values over time), andremove an identified routing alarm based on a comparison of the value ofthe alarm to a predetermined valued (e.g., when the value of theidentified routing alarm decreases below a predetermined value). A setof the alarms can be summarized to obtain a composite alarm. Theinstructions to summarize can include instructions to combine routingalarms based on network prefixes, Autonomous Systems on the networkand/or sub-networks on the network. The instructions to combine routingalarms based on network prefixes can include instructions to generate alist of more-specific prefixes and/or a list of origin Autonomous Systemprefixes based on the routing message data for the network prefixeslists of more-specific prefixes, and to combine the routing alarms forthe more-specific prefixes and for the origin Autonomous System prefixeschosen from the respective lists.

The instructions to analyze the correlated data can include instructionsto process one or more time series of the correlated data by detectingfeatures in the correlated data corresponding to a plurality of themultiple routers having similar patterns of message data over selectedportions of the time series. The instructions to detect features caninclude instructions to determine when the correlated data for themultiple routers indicates the routing message data exceeds a thresholdnumber of prefixes. The instructions can include instructions toidentify sub-networks and/or Autonomous Systems on the networkcorresponding to the correlated data of the features, and can includeinstructions to vary the timescales of the selected portions of the timeseries. The instructions to process can include instructions to applysignal processing techniques including feature detection, correlationand clustering techniques, where such techniques can be applied overmultiple time series, as provided herein.

Graphical representations of the routing message data and/or thecorrelated data can be presented to a user. The user can interactivelyquery the data based on the graphical representations. The computerprogram can include instructions to process the queries and present datamatching the queries to the user.

In one embodiment, a method of real-time delivery of network data caninclude collecting routing data from a plurality of routers on thenetwork, correlating the routing data across multiple routers and acrosstime to obtain the network data, and streaming the network data to usersover the network. Correlating the routing data can include determiningat least one of a number of network metrics, including a globallyreachable network prefix metric, an intensity metric indicative of totalrouting message traffic on the network, an unreachable network metric, aroute instability metric, route instability score distribution metrics.

Determining the globally reachable network prefix metric can includedetermining default-free routing table sizes over a predeterminedtimeframe, such that the metric reflects connectivity losses anddegradation events and variations in a size of the network. Determiningthe intensity metric can include determining total route announcementmessage traffic and total withdrawal message traffic. Determining theunreachable network metric can include tracking a number of sub-networksestimated to be temporarily unreachable, optionally conditioned on priorreachability to correct for expected levels of sub-network arrivals anddepartures. Determining the route instability metric can includeapplying an instability score to routes to each prefix, cumulativelycomputing the instability score for each prefix over time, andsuppressing the instability score following route stabilization.Determining the route instability score distribution metrics can includedetermining a set of vectorial metrics representing a breakdown of routeinstabilities according to severity and prefix size.

The method can include detecting features in the network datacorresponding to multiple ones of the plurality of routers havingsimilar patterns of network metrics over varying timescales. Detectingfeatures can include determining when the network data for each of themultiple ones of the plurality of routers indicates a number of prefixesexceeds a threshold number of prefixes for at least one metric. Themethod can include identifying sub-networks and/or Autonomous Systemscorresponding to prefixes associated with the network data of thefeatures.

In one embodiment, a method of providing routing alarms for a networkcan include processing, for a plurality of peer routers distributed inthe network, Border Gateway Protocol (BGP) UPDATE messages in timestamporder for network prefixes identified in the BGP UPDATE messages,setting at least one alarm condition for network prefixes based on acomparison of current messages received and previous messages received,correlating the alarm conditions over time and across multiple peerrouters, and firing a routing alarm for a network prefix when at leastone of the alarm conditions meets a temporal correlation criterionand/or a spatial correlation criterion. The alarm condition meets thetemporal correlation criteria when the alarm condition is set for apredetermined time duration, and the alarm condition meets the spatialcorrelation criteria when the alarm condition is set for a predeterminednumber of peer routers, or is set for a predetermined number of peerrouters having a specified geographical distribution.

Providing the routing alarms can include assigning a value to therouting alarms, applying a processing scheme to the values, and removingan identified routing alarm when the value of the identified routingalarm attains a predetermined value. The processing scheme can decreasethe values based on time, although other processing schemes can be used(e.g., fixed over time, fixed and decreasing schemes, etc.). A set ofrouting alarms can be summarized to obtain a composite alarm bycombining routing alarms based on network prefixes, Autonomous Systemson the network, and/or sub-networks on the network. The method cangenerate lists of more-specific prefixes and/or lists of originAutonomous System prefixes based on the routing message data for thenetwork prefixes, and can combine routing alarms for the more-specificprefixes and for the origin Autonomous System prefixes chosen from therespective lists.

The method can set a variety of alarm conditions based on varyingcriteria, including setting an ADVERTISED condition for a prefix to highwhen the prefix is advertised, setting a CHANGED condition for a prefixto high when the prefix is advertised with one or more different BGPattributes or when the prefix is withdrawn, setting a DEGRADED conditionfor a prefix to high when the prefix is advertised with a longer ASPATHor when the prefix is withdrawn, setting a WITHDRAWN condition for aprefix to high when the prefix is withdrawn, setting an UNREACHABLEcondition for a prefix to high when the prefix is withdrawn and there isno route to a less specific prefix, setting a DEAGGREGATION condition tohigh for a prefix when an unauthorized, more specific prefix isadvertised, and setting an ORIGIN condition for a prefix to high whenthe prefix was advertised by an unauthorized Autonomous System on thenetwork, or when an Autonomous System on the network advertises anunauthorized prefix.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a network environment that can accommodate themethods and systems described herein;

FIG. 2 illustrates an exemplary user interface for monitoring andanalysis of network routing data;

FIG. 3 illustrates an exemplary user interface for a global routingreport;

FIG. 4 illustrates an exemplary user interface for a provider map;

FIG. 5 illustrates an exemplary user interface for an AS neighbor graph;

FIG. 6 illustrates a flow chart for a method of setting conditionstates;

FIG. 7 illustrates a flow chart for a method of triggering alarms basedon the condition states;

FIG. 8 illustrates a flow chart for a method of varying alarm statusesover time; and,

FIG. 9 illustrates an exemplary user interface for alarm monitoring andconfiguring.

DESCRIPTION

To provide an overall understanding, certain illustrative embodimentswill now be described; however, it will be understood by one of ordinaryskill in the art that the systems and methods described herein can beadapted and modified to provide systems and methods for other suitableapplications and that other additions and modifications can be madewithout departing from the scope of the systems and methods describedherein.

Unless otherwise specified, the illustrated embodiments can beunderstood as providing exemplary features of varying detail of certainembodiments, and therefore, unless otherwise specified, features,components, modules, and/or aspects of the illustrations can beotherwise combined, separated, interchanged, and/or rearranged withoutdeparting from the disclosed systems or methods. Additionally, theshapes and sizes of components are also exemplary and unless otherwisespecified, can be altered without affecting the scope of the disclosedand exemplary systems or methods of the present disclosure.

The present disclosure is directed to network monitoring services thatcan monitor evolving routes to networks as seen from multiple vantagepoints in the network. In one embodiment, the methods and systems can beperformed substantially in real-time. The routing message data can becollected from a large number of routers on the network and stored in arepository of Border Gateway Protocol (BGP) update traffic. The data inthe repository can be correlated across multiple routers and acrosstime. Additionally, the data in the repository can correlate withrouting registry data and/or Domain Name Service (DNS) data. Interactivequeries, routing analyses, drill-down and forensics can be performed onthe collected data. In addition, data and analysis can be streamed to auser, for example, in real-time. Alarms can be provided and/or set todetect selected routing problems. In setting the alarms, the messagedata for routers can be processed in timestamp order. Current messagedata from routers can be compared with previous message data todetermine a condition status. An alarm can be fired when the conditionstatus meets temporal correlation criteria and/or spatial correlationcriteria.

For convenience and explanatory purposes, the systems and methods can bedescribed herein with reference to exemplary systems and methods for usewith the global Internet. However, the systems and methods describedherein are not to be limited to the embodiments disclosed herein, andcan be applicable to other networks with other configurations, and caninclude other applications and/or means for collecting data formonitoring network activity, and that additions, modifications, and/orother changes to the input, processing, and/or output to accommodatesuch other networks, configuration, and/or data are contemplated by thesystems and methods described herein and can be made by those skilled inthe art.

Referring to FIG. 1, a network 100 is illustrated, which can accommodatethe methods and systems described herein. Network 100 can include alarge number of Autonomous Systems (ASes) 102 and/or routers 104, a fewof which are shown in FIG. 1. As described previously herein, the numberof ASes on the global Internet is approaching 20,000. As used herein, anAS can be a connected group of one or more Internet Protocol (IP)networks having a single and clearly defined routing policy, that iscontrolled by a common network administrator (or group ofadministrators) on behalf of a single administrative entity (such as auniversity, a business enterprise, a business division, etc.), and canalso be referred to herein as a routing domain. Nodes on a given networkshare the same network prefix but have a unique host number. An AS caninclude one or more AS border routers 106 and can share routinginformation with other ASes using the Border Gateway Protocol (BGP).

A number of the AS routers 106 and/or routers 104, designated as 106 aand 104 a, respectively, can maintain peering sessions with collectionrouters 108. Generally, the peering sessions can be silent, thoughsessions can include sending data back to AS routers 106 a and routers104 a. Routers 104 a and AS routers 106 a can be strategically locatedthroughout network 100 to provide a perspective of routing messages onnetwork 100. Collection routers 108 can collect routing message datafrom the AS routers 106 a and routers 104 a for processing. Collectionrouters 108 do not announce routes to other routers such that therouting message data collected can reflect routing message data foractive network components. For clarity, collection routers 108 in FIG. 1are illustrated separate from network 100. In practice, some or all ofcollection routers 108 can be distributed within network 100.

Collection routers 108 can forward the collected message data to one ormore analysis servers 110 that can store or archive the data, as shownin the FIG. 1 embodiment by a BGP database 112. For clarity and ease ofexpression, analysis server 110 and database 112 can be illustrated andreferred to herein in the singular, though the use of multiplesynchronized analysis servers 110 and databases 112 is contemplated.Analysis server(s) 110 can process the message data from database(s) 112and provide clients 114 with tools for accessing, manipulating, and/orotherwise displaying the processed data to provide network monitoringservices to one or more clients 114. Clients 114 can monitor evolvingroutes to their networks as seen from multiple vantage points(collection routers 108) on network 100. When multiple analysis servers110 are used, the analysis servers 110 can be synchronized forprocessing data that can be distributed over multiple databases 112.Accordingly, the multiple databases 112 can further be synchronized andthus can communicate using wired and/or wireless communicationsprotocols and/or techniques.

Database 112 can include BGP UPDATE message data, routing registry data,DNS data, and/or other network data as can be obtained and/orcontemplated by those of skill in the art. BGP-speaking routers, such asrouters 104 and AS routers 106, can send BGP UPDATE message data totheir neighbor routers to announce their best routes to certainnetworks, or to withdraw routes that became unavailable. The neighboringBGP-speaking routers can propagate the UPDATEs to their neighbors, andso on. The UPDATEs are time stamped and can carry BGP attributes(referred to herein as “attribute(s)”) that can describe characteristicsof prefixes, e.g., an ASPATH attribute lists a sequence of traversedASes back to the AS originating the prefix. Other attributes caninclude, but not be limited to, Next Hop, iBGP Next Hop, Third PartyNext Hop, Origin, Aggregator, Local Preference, Multi-Exit Discriminator(MED), MED and Interior Gateway Protocol (IGP) Metric, Weight,Community, Well-Known Communities, and No-Export Community. An eventimpacting global routing can begin with one or more routers originatinga certain number of UPDATE messages at approximately the same time,after detecting a root cause routing event, such as a session open, arouter shutdown or loss of session, a session reset, and/or a change ofInterior Gateway Protocol (IGP) reachability or connectivity for an AS106.

The UPDATEs can be seen to propagate across the BGP-speaking routers asa kind of wave front traveling across the network 100 topology. Those ofskill in the art can recognize that correlation analysis of the UPDATEsreceived at routers 104 a and AS routers 106 a can detect and localizerouting problems, in the manner that earthquakes can be detected andlocalized by correlating data from a grid of geographically dispersedsensors. Typically, UPDATEs can be originated by multiple routers andreflect multiple root causes, and propagation can be likened to asuperposition of wave fronts. The FIG. 1 analysis server 110 can trackand correlate the UPDATEs for individual prefixes and/or aggregateprefixes arriving at distinct collection routers 108 to help isolate anddiagnose the distinct routing events causing the origination of theUPDATEs. Processing techniques can include feature detection schemes(e.g., Bayesian classifiers, neural networks, etc.), clustering, and/orother signal processing techniques for correlating multiple time seriesdata from multiple sensors.

Applying the above described correlations to the time stamped UPDATEdata from database 112, analysis server 110 can provide a number ofnetwork monitoring services to clients 114, including routing analysisfor a given time window/period/interval, streaming monitoring data(e.g., real-time) to clients 114, and alarms (e.g., real-time) toprovide clients 114 with the capability to detect and diagnose BGProuting problems originating outside of their networks.

FIG. 2 illustrates an exemplary user interface 200 that an analysisserver 110 can present to user 114 for monitoring and analysis ofnetwork 100 routing. Interface 200 is shown for illustrative purposesand other arrangements of the data and controls for manipulating andviewing the data are contemplated. Interface 200 can be configured toinclude a persistent window control framework 202 that can include menubar 204, navigation buttons 206 and a search field 208. In addition,window control framework 202 can include calendar navigation tool 210,progress indicator 212, prefix indicator 214, refresh selector 216 andtool indicator 218, and/or other navigation tools, selection tools,indicators and the like. In addition to window control framework 202,interface 200 can include a window 220 for displaying the requesteddata.

Menu bar 204 can have a number of pull down menus. FIG. 2 illustratesFiles, Edit, Tools, Viewmarks, Prefixes, Alarms and Help menus, thoughfewer or more menus and/or different arrangements of menus can becontemplated. In particular, Tools menu 222 can include a list ofavailable data display, analysis and alarm tools. When a tool isselected from Tools menu 222, the contents of window 220 change toreflect the use of the selected tool.

The Viewmarks menu 224 can allow for creation and retrieval of viewmarksfor saving references to the data view in the window 220 at the time theviewmark was created. The viewmarks can include extensible MarkupLanguage (XML) records corresponding to the data view in the window 220.The viewmarks can be used for future retrieval of the data view and/orfor sharing the data view, e.g., by emailing a viewmark to anotherclient 114. As an example, a series of viewmarks can be created duringdata analysis such that a time progression of the analysis can bepresented by sequentially retrieving the viewmarks. Viewmarks menu 224can include menu items for creating or adding viewmarks, presenting alisting of existing viewmarks, selecting a viewmark for display, eitherby replacing the current data view, or overlaying the current data viewwith a new frame, copying viewmarks, editing viewmarks, and/or deletingviewmarks.

The Prefixes menu 226 can provide for creating, selecting, editingand/or deleting lists of network prefixes that can be later selected fordirect link to prefix-specific analysis tools. The Alarms menu 228 canprovide for creating and editing alarms, as described herein in moredetail for the provision of real-time alarms by analysis server 110.

Navigation buttons 206 can provide for undoing and redoing selection andsetting changes, reloading data from analysis server 110, tracking thelatest available data, and/or stopping requests for data. Search tool208 can provide for searching or querying database 112 to obtain data.Queries can include, but not be limited to queries by AS numbers, prefixnames, domain names and/or other network attributes. Upon searching,window 220 can display connectivity information related to the selectedASes, prefixes and/or domain names. Thus, search tool 208 can provide anentry point to multiple tools for data display. FIG. 2 illustrates awelcome interface in window 220 that can provide client 114 with routinginformation of a more general nature for network 100, including numbersof active ASes and prefixes, overall network stability metrics, such asnumbers of BGP announcements/withdrawals, table sizes, unreachablenetworks, blackhole attacks, and listings of leading origins ofinstability.

Calendar navigation tool 210 can provide for choosing a timeframe ortime window (e.g., time interval, time period, etc.) of data foranalysis. For the exemplary interface 200, calendar navigation tool 210can include a calendar 230 for selection of a date and time for thestart of the data window, a time-range slider 232 superimposed ongraphical representations of aggregate BGP prefixannouncement/withdrawal rates, and slider controls 234 for adjusting anexpanse of time-range slider 232. Selection of the start of the datawindow through calendar 230 sets the left edge of time-range slider 232.The start can be adjusted by moving the left edge of time-range slider232, e.g., by clicking-on/selecting and “dragging” (e.g., manipulating,moving, etc.) the left edge with a mouse. The range of the window can beadjusted by moving the right edge of time-range slider 232. Time-rangeslider 232 can be moved left or right, as by dragging with a mouse, tochange the start time without changing the range. Other graphicalrepresentations and/or provisions for choosing a timeframe in additionto, or in lieu of, calendar navigation tool 210 of interface 200 can becontemplated by those of skill in the art.

Progress indicator 212 can provide for displaying status informationregarding data request by a client 114. For example, status informationcan include a count of pending requests, an indication of how much datafrom a pending request has been downloaded, and an indication of memoryusage. Prefix indicator 214 can indicate which prefix analysis server110 is processing. Refresh selector 216 provides for a client 114 toselect a refresh rate whereby window 220 can update the display to trackthe latest data at the selected rate. Tool indicator 218 can provide anindication of the tool selected from Tools menu 222.

FIG. 3 illustrates an exemplary user interface 300 for displaying aglobal routing report to client 114 in window 320, as chosen from Toolsmenu 322, and indicated by tool indicator 318. Generally, interface 300can correspond with interface 200 of FIG. 2, having persistent windowcontrol framework 302 similar to window control framework 202 of FIG. 2,such that reference numbers offset by 100 can refer to like features.Interface 300 is shown for illustrative purposes and other arrangementsof the data and controls for manipulating and viewing the data arecontemplated. The global routing report tool can provide a view onrouting activity in network 100 for the selected time range. The reportshown in window 320 can include three separate tools: BGP Announcements336; BGP Withdrawals 338; and Routing Table Size 340.

BGP Announcements 336 and BGP Withdrawals 338 can provide globallycorrelated, three-dimensional plots of the BGP prefix announcement ratesand withdrawal rates, respectively, recorded in the time frame selectedby the calendar navigation tool 310. The x-axes indicate time and thez-axes indicate the number of prefix announcements and withdrawals,respectively. The distinct parallel plot lines indexed on the y-axescorrespond to the displayed set of routers 104 a and ASes routers 106 a,associated with collecting routers 108 and referred to herein also aspeers 104 a, 106 a.

The plots 336, 338 can provide for observing the temporal correlationsamong the rates of prefix announcements and withdrawals, respectively,as received from distinct peers 104 a, 106 a. Wave-like or fence-likefeatures parallel to the y-axes can indicate routing events recorded bymost of the displayed peers 104 a, 106 a causing surges in prefixannouncements or withdrawals propagated globally across network 100.Single peaks and/or other features specific to a single peer 104 a, 106a can indicate a single AS 102 or router 104 reporting a routinginstability. Plots 336, 338 can include controls for modifying the plotaxes and for zooming in on features in the plots. For example, client114 can zoom in on wave-like feature 342 by selecting a range along thex-axis. Use of the controls can result in re-plotting the plotsaccording to the selected ranges.

Routing Table Size 340 can provide a two-dimensional plot of the sizesof BGP forwarding tables for a number of collection routers 108. Thex-axis indicates time and corresponds with the range shown in plot BGPAnnouncements 346 and BGP Withdrawals 338. The y-axis indicates thenumber of distinct routable prefixes, with each prefix listed once. Eachline of plot 340 corresponds to a single BGP routing table. Plot 340 canindicate routing events with global network impact when a number of thelines increase or decrease, for example, within a given time interval,which can be correlated with features in BGP Announcements 346 and BGPWithdrawals 338. Routing Table Size 340 can include controls formodifying the plot axes.

In addition to the plots 336-340, window 320 can include analysis box344, which can provide detailed information regarding significantrouting events detected in the selected data displayed in plots 336-340.In providing analysis box 344, an analysis server 110 can process theselected data for correlations, such as wave-like feature 342, which canidentify routing events. Such events can be tagged, as indicated by tags346, 348 in plot 338. For each tag, analysis box 344 can include anassociated tab 350. By selecting a tab, analysis server 110 can performan analysis of the associated event to determine a probable cause of thedetected, event. The results of the analysis can be presented inanalysis box 344 in terms of ASes which announced or withdrew theprefixes, and a listing of the prefixes. The ASes and prefixes presentedin analysis box 344 can be linked to other tools from Tools menu 222,e.g., an AS neighbor graph tool and a prefix tool, as described in moredetail herein.

As noted, Tools menu 222 can include prefix tools by which analysisserver 110 can process the BGP UPDATE data from database 112 for aselected prefix or group of prefixes over a selected period of time. Thedata can be processed and presented to client 114 in various formats,including overviews of routing activity for the selected prefix(es) inthe form of routing summaries, tables of raw traffic, route changes,route outages and route status, and provider maps.

FIG. 4 illustrates a portion of an exemplary interface 400 fordisplaying a provider map 436 to client 114 in window 420, as chosenfrom Tools menu 422 (not shown), with tool indicator 418 showing theselected prefix. Generally, interface 400 can correspond with interface200 of FIG. 2, having persistent window control framework 402 similar towindow control framework 202 of FIG. 2, such that reference numbersoffset by 200 from those of FIG. 2 can refer to like features. Interface400 is shown for illustrative purposes and other arrangements of thedata and controls for manipulating and viewing the data arecontemplated.

Provider map 436 can display origin ASes and the near portion of theroutes to the selected prefix that were observed over the selectedperiod of time from peers 104 a, 106 a. Thus, provider map 436 can showa subgraph of routes to the selected prefix from the network and canshow how the routes have been changing in time. Provider map 436 canidentify one or more prefixes 438 covering the selected prefix. Prefixes438 can include the single selected prefix, and/or can include a row ofone or more aggregated (less-specific) prefixes that contain theselected prefix, as shown in exemplary provider map 436 of FIG. 4. Whereapplicable, analysis server 110 can detect and display multiple originprefixes.

Connections between prefixes and ASes 440, between ASes 440 and one ormore network providers 442, and/or between ASes 440 and network core AS444 can be color coded, shaded, or otherwise distinctly displayed todistinguish the various connections and whether the connectionsrepresent an announced path or a withdrawn path. The thickness of theconnections can qualitatively indicate the fraction of peers 104 a, 106a announcing or withdrawing the prefix and whose ASPATH includes thegiven segment.

In addition, FIG. 4 illustrates a playback control mechanism 446 toexamine the time progression of prefix specific data. By choosingforward, reverse, stop, pause, play or other such features of playbackcontrol mechanism 446, similar to well-known controls for a videocassette recorder, client 114 can change the time period displayed in acontinuous or incremental fashion. Though shown in connection withprovider map 436, playback control mechanism 446 can be applicable tothe various prefix tools described above. Playback control mechanism 446can also include a time range display 448 with color coded, shaded, orotherwise distinctly displayed block indicators sized to qualitativelyrepresent the number of announcements or withdrawals. Time range display448 can be expanded to display multiple peers 104 a, 106 a, which can beuseful in identification and/or tracking of flap damping by upstreamASes and other routing events.

FIG. 5 illustrates an exemplary interface 500 for displaying an ASneighbor graph 536 to client 114 in window 520, as chosen from Toolsmenu 522, or as selected in search window 508. For the exemplary userinterface 500, tool indicator 518 notes that the AS neighbor graph 536is the result of an AS search. Generally, interface 500 can correspondwith interface 200 of FIG. 2, having persistent window control framework502 similar to window control framework 202 of FIG. 2, such thatreference numbers offset by 300 from those of FIG. 2 can refer to likefeatures. Interface 500 is shown for illustrative purposes and otherarrangements of the data and controls for manipulating and viewing thedata are contemplated.

AS neighbor graph 536 can include route registry information 538 for thegiven AS, a listing 540 of network prefixes originated by the given ASand an adjacency graph 542. Listing 540 can be organized as a ClasslessInter-Domain Routing (CIDR) tree so as to provide a view on theaggregation policy employed by the origin AS. The tree can be expandedor contracted by clicking-on/selecting icons near the prefixes, as iscommon for such tree structures. Optionally, selecting one or moreprefixes from listing 540 can result in displaying a listing of prefixtools available for selection by client 114.

Adjacency graph 542 displays the specified AS (AS number 6830 for theexemplary interface 500) in the middle of a star graph of neighbor ASes.The ASes can be color, or otherwise coded according to the number ofAS-neighbors they have. Adjacency graph 542 can include upstreamneighbors, downstream neighbors, or both, as selected by client 114.Upstream neighbors can include those that appear closer to collectionrouters 108 in the ASPATH attributes of the BGP messages than thespecified AS, while downstream neighbors are those that appear farther.Accordingly, upstream neighbors tend to be provider networks, whiledownstream neighbors tend to be customer networks, though otherrelationships between upstream/downstream neighbors can be contemplated.Optionally, selecting an AS from adjacency graph 542 can result indisplaying AS neighbor graph 536 for the selected AS. Optionally, client114 can choose, as indicated by tab 544, to view the neighborinformation in tabular format, where rows can indicate the most recentappearance of each neighborhood relation in BGP messages.

The methods and systems described herein optionally can stream routingdata as described above and/or as otherwise obtained from additionalanalyses of data in database 112, to client 114. Generally, streamingcan include providing reports (e.g., real-time) on the state andstability of global network BGP routing, delivered in XML format. Datacan be periodically updated, with the time period for updating selectedby client 114 and with sampling rates chosen to suit the data fordisplay. Data streams can include the number of globally reachablenetwork prefixes, intensity of route announcement and withdrawal messagetraffic, the number of unreachable networks, a route instability score,a distribution of route instability scores, geographic distribution ofthe number of unreachable networks, a listing of networks with thehighest number of route changes across the set of peers 104 a, 106 a, alisting of ASes with the largest numbers or originated unstablenetworks, and other data as client 114 can request from database 112.

The number of globally reachable network prefixes can be based ondefault-free routing table sizes over the selected time period. Theintensity can be indicative of the total routing message traffic overthe selected time period. The number of unreachable networks can trackthe number of networks that are estimated to be temporarily unreachable,conditioned on their prior reachability to correct for normal levels ofnetwork arrival and departure process due to economic and engineeringactivities. The route instability score can track the population ofunstable routes by applying an instability score to the routes to eachnetwork prefix. The per-prefix instability scores can be computedcumulatively over time and suppressed following route stabilization.

The distribution of the instability scores can include a set ofvectorial metrics representing the breakdown of route instabilitiesaccording to their severity and network prefix size. The geographicaldistribution can permit geographic localization of the impact ofconnectivity failures. The listings of unstable networks and unstableASes can also assist in monitoring and resolution of connectivityfailures.

Both the data representation described previously and the streaming datarepresentation can include monitoring for and/or providing routingalarms for alerting client 114 to potential and/or actual routingevents. Alarms can provide a capability for network problem detectionand diagnosis that can lower the cost of day-to-day network operations.Routing alarms can be organized hierarchically. The alarms at the bottomof the hierarchy can be referred to as atomic alarms, which fire whenthe routes to a given network prefix are observed to change in definedways, as will be described herein. For example, one can configure atomicalarms that fire when the prefix becomes unreachable from at least acertain threshold number of peers 104 a, 106 a, or when a route to theprefix with an unauthorized origin AS is announced by a peer 104 a, 106a. In addition, the systems and methods described herein can beconfigured to generate SNMP traps for collection and correlation by aremote network management system in response to atomic alarms.

A hierarchy of alarms above the atomic alarms can be referred to ascomposite alarms, or alarm groups, which summarize the status of a setof alarms. Composite alarms can include prefix alarms, which can combinetwo subsets of alarms: (1) a set of atomic alarms for the prefix (P)itself; and (2), recursively, the set of prefix alarms for theclient-approved more-specific network prefixes contained within P. Thelatter set can be empty if there are no approved more-specifics for P.At the time of prefix alarm configuration, the methods and systemsdescribed herein can initialize the list of more-specifics and the listof origin ASes on the basis of the analysis of the BGP UPDATEs receivedfrom peers 104 a, 106 a over a preceding time period, e.g., four weeks.The generated lists can be edited by client 114.

Composite alarms can further include AS alarms, whose components caninclude prefix alarms for prefixes originated by a given AS. When an ASalarm for a given AS is being configured, the methods and systemsdescribed herein can initialize the list of prefixes originated by theAS on the basis of the analysis of BGP UPDATEs received from peers 104a, 106 a over the preceding time period. The list can be edited byclient 114 by adding and deleting prefixes. Other composite alarms canbe custom configured by grouping existing prefix alarms and/or compositealarms, which can reflect organizational ownership of networks, theirphysical location, and/or their strategic importance.

The alarms can be operated in various modes, including a real-time modeand an historical mode. In real-time mode, alarms can be computed inresponse to BGP UPDATE messages as soon as the messages arrive frompeers 104 a, 106 a. In historical mode, alarms can be computed from thearchived BGP UPDATE in database 112, beginning at a start time selectedusing the time navigation tools described previously. The historicalmode can provide for “time travel”, allowing a user to view how pastrouting events could have been detected by the configured alarms tofine-tune alarm configuration parameters. Further, the historical modecan be helpful in forensic analysis, where alarms can be configured tofire on specified events.

As noted, atomic alarms can be characterized by a single primary prefixP, and a trigger condition. For certain trigger conditions, an atomicalarm can additionally be characterized by a list of approved morespecific prefixes, or a list of approved origin ASes for the prefix P.BGP messages for peers 104 a, 106 a can be analyzed by analysis server110 to determine an alarm state, or condition for peers. Various alarmstypes can trigger atomic alarms based on the BGP UPDATEs received. Alarmtypes can include those shown in Table 1, though those of skill in theart can contemplate additional types of alarms. For each alarm type,there can be a corresponding peer alarm condition type.

TABLE 1 Alarm name Alarm description ADVERTISED Prefix P was advertised.CHANGED Prefix P was advertised with one or more different attributes,or withdrawn. DEGRADED Prefix P was advertised with a longer ASPATH, orwithdrawn. WITHDRAWN Prefix P was withdrawn. UNREACHABLE Prefix P waswithdrawn, and there is no route to any less specific prefix for P fromthe same peer. DEAGGRE- An unauthorized more-specific prefix P' wasGATION advertised; that is, a prefix that is more specific than P butnot on the approved list of more-specifics. ORIGIN Prefix P wasadvertised as originated by an un- authorized AS, or an AS advertised anun- authorized prefix P.

FIG. 6 illustrates a method 600 by which analysis server 110 can setcondition states for a prefix P based on BGP UPDATE messages received.Analysis server 110 of FIG. 1 can receive 602 an UPDATE message and candetermine 604 the prefix P, or a more or less specific prefix, containedin the Network Layer Reachability Information (NLRI) field of the UPDATEmessage. Analysis server 100 can set or clear condition states for theconditions shown in Table 1 for the determined prefix. FIG. 6 providesan exemplary method for setting and/or clearing the condition states,though actions shown therein can be otherwise combined, separated,interchanged, and/or rearranged with more or fewer actions by those ofskill in the art without departing from the disclosed method.

The exemplary method 600 of FIG. 6 can determine if the prefix P isADVERTISED 606. If it is, the ADVERTISED state is set to high and theWITHDRAWN and UNREACHABLE states are cleared 608, as applicable. If theprefix P was advertised with one or more different attributes, asdetermined at 610, then the CHANGED state is set to high 612. If theprefix P was advertised with a longer ASPATH, as determined at 614, thenthe DEGRADED state is set to high 616. If a prefix that is more specificthan P but not on the approved list of more-specifics was advertised, asdetermined at 618, then the DEAGGREGATION state is set to high 620. Ifprefix P was advertised as originated by an unauthorized AS, or an ASadvertised an unauthorized prefix, as determined at 622, then the ORIGINstate is set to high 624. If the conditions determined at 610, 614, 618,or 622 are not met, then the CHANGED state, the DEGRADED state, theDEAGGREGATION state, or the ORIGIN state are cleared, as applicable at626, 628, 630, or 632, respectively, and method 600 can proceed tocorrelation of the condition states, as indicated at “A”.

If the prefix P is WITHDRAWN, as determined at 606, then the WITHDRAWN,CHANGED, and DEGRADED states can be set to high, and the ADVERTISED,DEAGGREGATION, and ORIGIN states can be cleared, as applicable at 634.If there is no route to any less specific prefix P from the same peer,as determined at 636, then the UNREACHABLE state can be set to high 638.If there is a route, then the UNREACHABLE state can be cleared 640, asapplicable, and method 600 can proceed to correlation of the conditionstates, as indicated at “A”. The following examples can illustrate thesetting of condition states.

In a first example, a BGP UPDATE is received 602 from peer 0 and isdetermined 604 to be for prefix 192.168.0.0/16. The message isdetermined 606 to contain a withdrawal, and the WITHDRAWN, CHANGED andDEGRADED condition states are set to high, while the ADVERTISED,DEAGGREGATION and ORIGIN condition states are cleared at 634, asapplicable. For this example, peer 0 previously had a valid route to192.168.0.0/16, but there is no route to a less-specific prefix for Pfrom the same peer, and the UNREACHABLE condition state is set to high.If a subsequent BGP UPDATE is received from the same peer with anadvertisement of a route to 192.168.0.0/16, then the WITHDRAWN andUNREACHABLE condition states can be cleared, as at 608.

In a second example, a BGP UPDATE from peer 0 contains a withdrawal forprefix 192.168.12.0/24. As previously, the WITHDRAWN, CHANGED andDEGRADED condition states are set to high, while the ADVERTISED,DEAGGREGATION and ORIGIN condition states are cleared at 634, asapplicable. For this example, peer 0 previously had valid routes to both192.168.0.0/16 and 192.168.0.0/24. Because the route to 192.168.0.0/16still exists, the more-specific is not entirely unreachable, and theUNREACHABLE condition state is cleared at 640, as applicable.

FIG. 7 illustrates a method 700 that can trigger atomic alarms based onthe condition states determined in method 600. Method 700 can start at“A” and determine 702 if one or more of the alarm condition states frommethod 600 are set to high. An alarm condition state that is set to highcan also be referred to herein as an alarm condition that has fired, orconversely, when an alarm condition fires, the alarm condition state isset to high. For each alarm condition that has fired, method 700 canexamine the cumulative history of firings to determine whether temporaland/or spatial correlation criteria have been met.

The peer alarm condition states can be time stamped when fired (when thealarm condition state is set to high). Further, a client configurable“minimum” and “maximum” hold time can be associated with one or morealarm conditions. If the time since firing the alarm condition is atleast equal to the minimum hold time, but not longer than the maximumhold time, the temporal correlation criteria is met, as determined at704. Generally, the minimum hold time can default to zero, such that analarm condition is reported upon firing. Also, the maximum hold time candefault to infinity, such that there is no maximum hold time.

Each peer alarm condition can also include a client configurable peerdiversity threshold, which can indicate a minimum number of peercondition alarms for triggering an atomic alarm. If the number of peercondition alarms fired for a given alarm condition exceeds the diversitythreshold, as determined at 706, the spatial correlation criteria ismet. Requiring a threshold number of peer alarm conditions to be met canreduce “noise” signals that may be due to one or a small number of peersand that may not reflect the behavior of routes seem by the majority ofrouters. The diversity threshold can be configured to encompassgeographically separated routers and/or a threshold number of routers.For example, the diversity threshold can be configured to require thatthe threshold number of peer conditions are spread over a geographicregion, rather than being concentrated at a single geographic location.

If either the temporal and spatial correlation criteria is met for agiven alarm condition, the associated atomic alarm can fire 708, or canbe maintained in a firing state if the associated atomic alarm isalready in a firing state. If both the temporal and spatial conditionsare not met for a given alarm condition, the associated atomic alarm canbe maintained in non-fired mode 710, or can be made to “stand down” ifthe associated alarm is already in a firing state. When an atomic alarmfires, an alert can be generated 712 and a log can be kept 714.Similarly, a log entry can indicate when an alarm stands down. Method700 can continue 716 to check for high condition states received frommethod 600.

FIG. 8 illustrates optional further criteria that can be tracked foratomic alarms that have fired. In addition to the temporal and spatialcorrelation criteria of method 700, the atomic alarms can becharacterized by an alarm status. When an atomic alarm fires, method 800of FIG. 8 can set the status of the alarm at a certain initial value, asindicated at 802. A processing scheme can be applied to the alarmstatus, which can vary the alarm status over time 804. Thefunction-based alarm status can be determined periodically (e.g., everyfive seconds) 806. When the processing-scheme-based alarm status meets acertain threshold, as determined at 808, the alarm can stand down 810and the event can be entered in the log 812. In one embodiment, theprocessing scheme can be an exponential decay, with a half life asspecified by client 114, although other processing schemes can be used.For example, processing schemes can include a step function, where thealarm status can remain substantially constant over certain timeintervals, and/or other processing schemes that can vary based on and/orover time.

In addition to the atomic alarms, the methods and systems describedherein can support composite alarms, or alarm groups, as notedpreviously. The alarm groups can be predefined and/or can be configuredby client 114. Unlike the atomic alarms, alarm groups need not beevent-driven. Rather, the alarm groups can combine the status of theirconstituent atomic alarms in defined ways to compute their own status.The composite alarms can be used as proxies for very large alarm sets tomake efficient use of limited space for displaying alarms. The alarmsmenu of menu bar 204 in FIG. 2 can provide predefined alarm groups tofacilitate hierarchy management, including the alarm groups indicated inTable 2.

TABLE 2 Alarm group name Alarm group definition SINGLE PREFIX The groupof supported atomic alarms ALARM for prefix P. MORE-SPECIFIC The groupof prefix P alarms for more- ALARMS specific prefixes contained with agiven prefix P. AGGREGATE The group pf alarms for a given prefix P(single PREFIX ALARM prefix alarms for P, together with prefix alarmsfor approved more-specifics). AUTONOMOUS The group of prefix alarms forprefixes SYSTEM ALARM originated by a given autonomous system. ROOTALARM GROUP The group of client alarms and alarm groups.

Alarm groups can compute their status based on the individual statusesof the alarms they contain. The processing scheme used to compute thestatus can be selectable by client 114, according to the intendedpurpose of the group. Representative processing schemes can include, butare not necessarily limited to, a maximum scheme, an average scheme,and/or a weighted average scheme. For a group using an maximum scheme,the status can be computed as the highest and/or greatest status of theconstituents of the group. For example, if a group of four alarms haveindividual computed statuses of {0.5, 0.2, 0.1, 0.0}, the status of thegroup as a whole would be the maximum=0.5. For a group using an averagescheme, the status can be computed as the sum of the statuses of theconstituents of the group divided by the number of constituents. Forexample, if a group of four alarms have individual computed statuses of{0.5, 0.2, 0.1, 0.0}, the average status would be (0.5+0.2+0.1)/4=0.2.

For a group using a weighted average scheme, the status can be computedby applying weights to the statuses of the constituents, adding theweighted statuses and dividing by the sum of the weights fornormalization. The weights can be assigned by client 114. For example,in a group of four alarms, the first of which is ten times moreimportant than the others, client 114 can assign the weights {10, 1, 1,1}. If, at some point these four alarms have statuses of {0.5, 0.2, 0.1,0.0}, the alarm group as a whole would have status(10*0.5+1*0.2+1*0.1+1*0.0)/13=0.408. It is noted that an average schemecan include a special case of a weighted average scheme, where theweights are equal. A variety of weighting schemes can be used.

FIG. 9 illustrates an exemplary interface 900 for configuring anddisplaying graphical representations of alarm data to client 114 inwindow 920, as chosen from Tools menu 922, or Alarms menu 928, with toolindicator 918 indicating a real-time alarm monitoring mode. Generally,interface 900 can correspond with interface 200 of FIG. 2, havingpersistent window control framework 902 similar to window controlframework 202 of FIG. 2, such that reference numbers offset by 700 fromthose of FIG. 2 can refer to like features. Interface 900 is shown forillustrative purposes and other arrangements of the data and controlsfor manipulating and viewing the data are contemplated.

In the exemplary interface 900, the configured alarms can be displayedas a tree structure 936 adjacent to graph 938 when the real-time orhistorical alarm tool is started from Tools menu 922 or Alarm menu 928.Initially, tree structure 936 can display a line for each top-levelprefix alarm, autonomous system alarm, or named alarm group. Client 114can interactively expand the display to inspect the constituent alarmswithin the groups, down to the level of individual primitive (or atomic)alarms. Display of constituent alarms below the top level of treestructure 936 that are inactive, as well as alarms that have beenmanually disabled by client 114, can be suppressed, or otherwise notshown, to make more efficient use of limited screen space. As theybecome active, these alarms can be shown in order.

The lines of graph 938 can correspond with adjacent lines of treestructure 936. The lines of graph 938 can include status indicators 940and plots 942 of alarm history for a time period as can be chosen usingnavigation buttons and/or tools 906, 910. Status indicators 940 can becolored, shaded, or otherwise distinguished to indicate various statuslevels. For real-time alarm monitoring, as illustrated in exemplaryinterface 900, window 920 can be periodically updated with the latestalarm data as processed by analysis server 110. Alarm data can bestreamed similar to the streaming of routing data, as previouslydescribed, where client 114 can chose the update period using refreshselector 916.

Plots 942 can include designations for uncorrelated peer alarm “set” and“clear” events, as described with relation to FIG. 6. The designationscan be colored, shaded, or otherwise distinguishable to indicate thetype of event shown. The uncorrelated, low-level events can provide agood sense of the underlying routing activity contributing to changes inthe evolving status of each alarm over the recent time period displayed.Set/clear indications or designations can “flow up” from constituentalarms to the alarm groups that contain them. Thus, the historicalcontext plot for an alarm group can display the low-level set/clearevents for its constituents, and its constituents' constituents,recursively.

The plot lines can show the current status of the atomic and compositealarms plotted over time. The plot lines can also be colored, shaded, orotherwise distinguished to indicate whether the alarm is an atomic alarmin alert status. When client 114 selects a given alarm from graph 938,lower frame 944 of window 920 can display additional information aboutthe selected alarm. Client 114 can inspect the detailed alerts, asdescribed with relation to FIG. 7, and/or the set/clear events, asdescribed with relation to FIG. 6, that generated the observed status.The alarm groups can fuse and/or otherwise combine the alerts andlow-level events from their constituent alarms for display.

In addition to displaying alarm information, Alarms menu 928 can includetools for creating and/or editing alarms configurations. For example, aprefix alarm can be created by entering a primary prefix in standarddot-decimal notation (e.g., 10.1.2.0/24). The methods and systemsdescribed herein can search the prefix advertisement history data indatabase 112 over a predetermined time frame and identify less specificprefixes and more specific networks. Client 114 can choose to alarm onthe less specific prefixes, and can use the more specific networkinformation for pre-configuring the DEAGGREGATION alarm for the primaryprefix, and for recursive incorporation in the aggregate prefix alarm,if desired.

For AS alarms, client 114 can enter the AS number and the methods andsystems described herein can search the prefix advertisement historydata in database 112 over a predetermined time frame and initialize alist of prefixes originated by the AS. Alarm configurations can beedited by choosing the alarm from the graph 938 and/or tree structure936, and selecting an edit tool.

The user interfaces that analysis server 110 can present to user 114,including the exemplary user interfaces 200, 300, 400, 500, and 900described herein, can include hyperlinks for navigating between variousinterfaces. For example, the AS numbers and addresses in the listing ofleading origins of instability in FIG. 2 can include hyperlinks torespective interface 500 of FIG. 5 and interface 400 of FIG. 4. Byclicking-on/selecting ASN 7137 in the listing of FIG. 2, the AS neighborgraph for ASN 7137, similar to graph 536 of FIG. 5, can be presented touser 114. Other data from others of the user interfaces can be similarlyhyperlinked to provide for navigating among the various interfaces, andthus providing user 114 with interactive querying capabilities.

It is clear that there are many ways to configure the system components,interfaces and methods described herein. The disclosed methods andsystems can be deployed on convenient processor platforms, includingnetwork servers, personal and portable computers, and/or otherprocessing platforms. Other platforms can be contemplated as processingcapabilities improve, including personal digital assistants,computerized watches, cellular phones and/or other portable devices. Thedisclosed methods and systems can be integrated with known networkmanagement systems and methods. The disclosed methods and systems canoperate as an SNMP agent, and can be configured with the IP address of aremote machine running a conformant management platform. Therefore, thescope of the disclosed methods and systems are not limited by theexamples given herein, but can include the full scope of the claims andtheir legal equivalents.

The methods and systems described herein are not limited to a particularhardware or software configuration, and may find applicability in manycomputing or processing environments. The methods and systems can beimplemented in hardware or software, or a combination of hardware andsoftware. The methods and systems can be implemented in one or morecomputer programs, where a computer program can be understood to includeone or more processor executable instructions. The computer program(s)can execute on one or more programmable processors, and can be stored onone or more storage medium readable by the processor (including volatileand non-volatile memory and/or storage elements), one or more inputdevices, and/or one or more output devices. The processor thus canaccess one or more input devices to obtain input data, and can accessone or more output devices to communicate output data. The input and/oroutput devices can include one or more of the following: Random AccessMemory (RAM), Redundant Array of Independent Disks (RAID), floppy drive,CD, DVD, magnetic disk, internal hard drive, external hard drive, memorystick, or other storage device capable of being accessed by a processoras provided herein, where such aforementioned examples are notexhaustive, and are for illustration and not limitation.

The computer program(s) can be implemented using one or more high levelprocedural or object-oriented programming languages to communicate witha computer system; however, the program(s) can be implemented inassembly or machine language, if desired. The language can be compiledor interpreted.

As provided herein, the processor(s) can thus be embedded in one or moredevices that can be operated independently or together in a networkedenvironment, where the network can include, for example, a Local AreaNetwork (LAN), wide area network (WAN), and/or can include an intranetand/or the Internet and/or another network. The network(s) can be wiredor wireless or a combination thereof and can use one or morecommunications protocols to facilitate communications between thedifferent processors. The processors can be configured for distributedprocessing and can utilize, in some embodiments, a client-server modelas needed. Accordingly, the methods and systems can utilize multipleprocessors and/or processor devices, and the processor instructions canbe divided amongst such single or multiple processor/devices.

The device(s) or computer systems that integrate with the processor(s)can include, for example, a personal computer(s), workstation (e.g.,Sun, HP), personal digital assistant (PDA), handheld device such ascellular telephone, laptop, handheld, or another device capable of beingintegrated with a processor(s) that can operate as provided herein.Accordingly, the devices provided herein are not exhaustive and areprovided for illustration and not limitation.

References to “a microprocessor” and “a processor”, or “themicroprocessor” and “the processor,” can be understood to include one ormore microprocessors that can communicate in a stand-alone and/or adistributed environment(s), and can thus can be configured tocommunicate via wired or wireless communications with other processors,where such one or more processor can be configured to operate on one ormore processor-controlled devices that can be similar or differentdevices. Use of such “microprocessor” or “processor” terminology canthus also be understood to include a central processing unit, anarithmetic logic unit, an application-specific integrated circuit (IC),and/or a task engine, with such examples provided for illustration andnot limitation.

Furthermore, references to memory, unless otherwise specified, caninclude one or more processor-readable and accessible memory elementsand/or components that can be internal to the processor-controlleddevice, external to the processor-controlled device, and/or can beaccessed via a wired or wireless network using a variety ofcommunications protocols, and unless otherwise specified, can bearranged to include a combination of external and internal memorydevices, where such memory can be contiguous and/or partitioned based onthe application. Accordingly, references to a database can be understoodto include one or more memory associations, where such references caninclude commercially available database products (e.g., SQL, Informix,Oracle) and also proprietary databases, and may also include otherstructures for associating memory such as links, queues, graphs, trees,with such structures provided for illustration and not limitation.

References to a network are not limited to the full Internet, and caninclude portions thereof. References herein to microprocessorinstructions or microprocessor-executable instructions, in accordancewith the above, can be understood to include programmable hardware.

Unless otherwise stated, use of the word “substantially” can beconstrued to include a precise relationship, condition, arrangement,orientation, and/or other characteristic, and deviations thereof asunderstood by one of ordinary skill in the art, to the extent that suchdeviations do not materially affect the disclosed methods and systems.Further, references herein to real-time can be understood to beabbreviations for “substantially in real-time.” Although the illustratedembodiments of the methods and systems refer to certain aspects being in“real-time,” such aspects may be provided in other manners.

Throughout the entirety of the present disclosure, use of the articles“a” or “an” to modify a noun can be understood to be used forconvenience and to include one, or more than one of the modified noun,unless otherwise specifically stated.

Although the methods and systems have been described relative tospecific embodiments thereof, they are not so limited. Obviously manymodifications and variations may become apparent in light of the aboveteachings.

Many additional changes in the details, materials, and arrangement ofparts, herein described and illustrated, can be made by those skilled inthe art. Accordingly, it will be understood that the methods and systemsprovided herein are not to be limited to the embodiments disclosedherein, can include practices otherwise than specifically described, andare to be interpreted as broadly as allowed under the law.

1. A method of mapping network stability, comprising: receiving BGPupdates from routers in a plurality of autonomous networks of a networkwherein the BGP updates comprise one or more of a BGP announcement,announcing a feasible route to a destination, and a BGP withdrawal,announcing a withdrawal of a previously announced feasible route to thedestination; based at least in part on the BGP updates, determining, forat least one of the routers, at least one of a BGP announcement rate anda BGP withdrawal rate, each of the announcement and withdrawal ratesrelating, in part, to a number of feasible routes to the destinationduring a time frame, and the at least one of the determined BGPannouncement and withdrawal rates being used to compute a networkstability metric; and based on the at least one of the determined BGPannouncement rate and BGP withdrawal rate for the at least one routerupdating (i) a map of the network, the map comprising the feasibleroutes, and (ii) a database comprising a global routing table for theplurality of autonomous networks.
 2. The method of claim 1, wherein theglobal routing table includes route information for at least oneautonomous network based on BGP updates from route neighbors of the atleast one autonomous network.
 3. The method of claim 1, whereindetermining for the at least one router at least one of a BGPannouncement rate and a BGP withdrawal rate includes determining one ofthe plurality of autonomous networks that includes the at least onerouter.
 4. The method of claim 1, wherein each of the announcement andwithdrawal rates relates to a rate at which the number of feasible pathsto the destination is changing.
 5. The method of claim 1, whereinupdating the global routing table comprises indicating, based on the atleast one of the determined BGP announcement rate and BGP withdrawalrate, a number of distinct routable destinations during the time frame.6. The method of claim 1, wherein the network stability metric comprisesat least one of a number of BGP announcements, a number of BGPwithdrawals, a number of unreachable networks, a number of blackholeattacks, a size of the global routing table, or a listing of leadingorigins of instability.
 7. A computer-implemented method of mappingnetwork stability comprising: receiving BGP updates from routers thatexchange BGP updates with a plurality of autonomous networks of anetwork; obtaining from the BGP updates at least one of a BGPannouncement, announcing a feasible route to a destination, and a BGPwithdrawal, announcing a withdrawal of a previously announced feasibleroute to the destination; determining, for at least one autonomousnetwork of the plurality of autonomous networks, at least one of a BGPannouncement rate and a BGP withdrawal rate, each of the announcementand withdrawal rates relating, in part, to a number of feasible routesto the destination during a time frame, and the at least one of thedetermined BGP announcement and withdrawal rates being used to compute anetwork stability metric; and based on at least one of the determinedBGP announcement rate and BGP withdrawal rate for the at least oneautonomous network, updating (i) a map of the network, the mapcomprising the feasible routes, and (ii) a database comprising a globalrouting table for the plurality of autonomous networks.
 8. The method ofclaim 7, wherein the global routing table includes route information forat least one autonomous network based on BGP updates from routeneighbors of the at least one autonomous network.
 9. The method of claim7, wherein determining, for the at least one autonomous network, atleast one of a BGP announcement rate and a BGP withdrawal rate includesdetermining a BGP announcement rate or a BGP withdrawal rate for atleast one router in the at least one autonomous network.
 10. The methodof claim 7, wherein each of the announcement and withdrawal ratesrelates to a rate at which the number of feasible paths to thedestination is changing.
 11. The method of claim 7, wherein updating theglobal routing table comprises indicating, based on the at least one ofthe determined BGP announcement rate and BGP withdrawal rate, a numberof distinct routable destinations during the time frame.
 12. The methodof claim 7, wherein the network stability metric comprises at least oneof a number of BGP announcements, a number of BGP withdrawals, a numberof unreachable networks, a number of blackhole attacks, a size of theglobal routing table, or a listing of leading origins of instability.